Breaking limitation of quantum annealer in solving optimization problems under constraints
نویسندگان
چکیده
منابع مشابه
Reliability optimization problems with multiple constraints under fuzziness
In reliability optimization problems diverse situation occurs due to which it is not always possible to get relevant precision in system reliability. The imprecision in data can often be represented by triangular fuzzy numbers. In this manuscript, we have considered different fuzzy environment for reliability optimization problem of redundancy. We formulate a redundancy allocation problem for a...
متن کاملTraffic Flow Optimization Using a Quantum Annealer
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave Systems [1], have been subject to multiple analyses in research, with the aim of characterizing the technology’s usefulness for optimization and sampling tasks ...
متن کاملOn Solving Optimization Problems with Ordered Average Criteria and Constraints
The problem of aggregating multiple numerical attributes to form overall measure is of considerable importance in many disciplines. The ordered weighted averaging (OWA) aggregation, introduced by Yager, uses the weights assigned to the ordered values rather than to the specific attributes. This allows one to model various aggregation preferences, preserving simultaneously the impartiality (neut...
متن کاملIteratively Solving Linear Inverse Problems under General Convex Constraints
We consider linear inverse problems where the solution is assumed to fulfill some general homogeneous convex constraint. We develop an algorithm that amounts to a projected Landweber iteration and that provides and iterative approach to the solution of this inverse problem. For relatively moderate assumptions on the constraint we can always prove weak convergence of the iterative scheme. In cer...
متن کاملSensitivity Analysis of Optimization Problems Under Second Order Regular Constraints
We present a perturbation theory for nite dimensional optimization problems subject to abstract constraints satisfying a second order regularity condition. We derive Lipschitz and HH older expansions of approximate optimal solutions, under a directional constraint qualiication hypothesis and various second order suucient conditions that take into account the curvature of the set deening the con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2020
ISSN: 2045-2322
DOI: 10.1038/s41598-020-60022-5